Invariant Definability (Extended Abstract)
نویسنده
چکیده
To prove the conjecture for this case we observe that if K 0 is FOL{deenable with equality only, then L = INV K0 (L) by proposition 5, and hence EV EN is not K 0-invariantly LFP-deenable. Hence we have Corollary 26. If K 0 is f-categorical and closed under substructures and L 6 = INV K0 (L) then a linear order is deenable with parameters on K 0. In particular , this is the case if EV EN 2 INV K0 (LFP), L INV K0 (LFP) or P INV K0 (LFP). The general case of the conjecture seems diicult, as K can be rather complicated and the assumption that there is no parametrically deenable order is hard to handle. The latter reminds us of Shelah's characterization of stability, cf. She90], although the situation is not quite the same: Our models are nite and the order, if present, has to be total. On the other side, we do not deal with complete theories. E. Rosen has announced that the conjecture is true if K consists of a class of pre-orders, i.e linear orders of equivalence classes. More precisely: Theorem 27 (E. Rosen). If K is a class of pre-orders such that every K 1 2 P is K-invariantly LFP-deenable then ORD is parametrically LFP-deenable (actually even FOL-deenable) in K. The proof will be published in RM97]. References AF90] M. Ajtai and R. Fagin. Reachability is harder for directed than for undirected nite graphs. 1 {formulae on nite structures. Example 5. Let = fExyg, and let K 2 = fA j A is a chaing. Here, A is a chain ii it is a connected simple undirected graph such that every vertex has degree exactly 2. Observe that, up to isomorphism, there is a unique chain of each nite cardinality, and that it is non-rigid with automorphism group of size = 2 card(A). Observe that a linear order is FOL{deenable with parameters over K 1 and LFP{deenable with parameters over K 2. We conjecture that this deenability property provides both a necessary and suucient condition for INV K (LFP) to contain P, (the suuciency having just been established). More precisely, as stated in the introduction Conjecture: For any class K, P INV K (LFP) ii a linear order is parametrically deenable on K. This is the major conjecture of this note, though one can also ask many similar questions concerning invariant deenability …
منابع مشابه
Interpolation Properties, Beth Definability Properties and Amalgamation Properties for Substructural Logics
This paper develops a comprehensive study of various types of interpolation properties and Beth definability properties for substructural logics, and their algebraic characterizations through amalgamation properties and epimorphisms surjectivity. In general, substructural logics are algebraizable but lack many of the basic logical properties that modal and superintuitionistic logics enjoy (cf. ...
متن کاملDiscontinuous Phenomena and Turing Definability
We discuss the relationship between discontinuity and definability in the Turing degrees, with particular reference to degree invariant solutions to Post’s Problem. Proofs of new results concerning definability in lower cones are outlined.
متن کاملBeth Definability in Institutions
BETH DEFINABILITY IN INSTITUTIONS MARIUS PETRIA∗ AND RĂZVAN DIACONESCU Abstract. This paper studies definability within the theory of institutions, a version of abstract model This paper studies definability within the theory of institutions, a version of abstract model theory that emerged in computing science studies of software specification and semantics. We generalise the concept of definab...
متن کاملHanf Locality and Invariant Elementary Definability
We introduce some notions of invariant elementary definability which extend the notions of first-order order-invariant definability, and, more generally, definability invariant with respect to arbitrary numerical relations. In particular, we study invariance with respect to expansions which depend not only on (an ordering of) the universe of a structure, but also on the particular relations whi...
متن کاملEquivalence Relations Invariant under Group Actions
We study, in an abstract context, equivalence relations which are invariant under group actions. More precisely, we fix a transformation group, and we study the orbital equivalence relations (i.e. orbit equivalence relations of normal subgroups) and a wider class of weakly orbital equivalence relations. For these sorts of relations we show (under some additional assumptions) that if each class ...
متن کاملEffective Reducibilities on Structures and Degrees of Presentability
In this survey paper we consider presentations of structures in admissible sets and some effective reducibilities between structures and their degrees of presentability. Degrees of Σ-definability of structures, as well as degrees of presentability with respect to different effective reducibilities, are natural measures of complexity which are total, i.e. defined for any structure. We also consi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997